________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:25:00
Input Data from:  dataset123.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,059
Average f[i]   :3700
Average g[i,j] :2090,47619047619
Total demand   :11130
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 8
> Selected Move:	700	1	-1	8	4500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0    >new incumb.: 700


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 31
> Selected Move:	1260	1	-1	7	11000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0    >new incumb.: 1260


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 37
> Selected Move:	1770	1	-1	3	15000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  0    >new incumb.: 1770


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 38
> Selected Move:	2280	1	-1	4	19500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  1  0    >new incumb.: 2280


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 33
> Selected Move:	2150	3	7	9	19000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 35
> Selected Move:	2190	3	4	5	20000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 28
> Selected Move:	2140	3	9	6	20000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 27
> Selected Move:	2110	3	6	4	18500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 30
> Selected Move:	2100	3	0	7	20000


> New Y[]: 
	
	 0  3  4  1  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 18
> Selected Move:	1828	3	5	9	20500


> New Y[]: 
	
	 0  3  4  1  1  0  0  2  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 20
> Selected Move:	1780	3	9	6	20500


> New Y[]: 
	
	 0  3  4  1  1  0  1  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 13
> Selected Move:	2100	3	7	0	19000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 32
> Selected Move:	1920	3	8	5	20000


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 30
> Selected Move:	1970	3	6	9	20000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 29
> Selected Move:	1870	3	9	7	20500


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 23
> Selected Move:	2093	3	4	8	20500


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 21
> Selected Move:	1760	2	7	-1	14000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 36
> Selected Move:	1750	3	3	7	16500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 33
> Selected Move:	1760	3	5	4	15500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 37
> Selected Move:	1720	3	7	3	13000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 34
> Selected Move:	1690	3	1	5	14700


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 31
> Selected Move:	1823	1	-1	9	20700


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 18
> Selected Move:	1776	3	9	6	20700


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 17
> Selected Move:	1752	3	6	7	21200


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 24 #######################


> Neighbours evaluated; 13
> Selected Move:	1914	4	5	7	20800


> New Y[]: 
	
	 2  0  4  1  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 25 #######################


> Neighbours evaluated; 17
> Selected Move:	1740	2	4	-1	16300


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 26 #######################


> Neighbours evaluated; 28
> Selected Move:	1740	4	7	3	18500


> New Y[]: 
	
	 2  0  4  3  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 27 #######################


> Neighbours evaluated; 23
> Selected Move:	1740	4	3	5	16700


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,41

## ITERATION 28 #######################


> Neighbours evaluated; 25
> Selected Move:	1740	4	5	8	18200


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 29 #######################


> Neighbours evaluated; 26
> Selected Move:	1740	3	8	1	16000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 30 #######################


> Neighbours evaluated; 35
> Selected Move:	1740	3	0	8	18200


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 31 #######################


> Neighbours evaluated; 24
> Selected Move:	1740	4	8	3	18300


> New Y[]: 
	
	 0  3  4  2  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,39

## ITERATION 32 #######################


> Neighbours evaluated; 22
> Selected Move:	1740	4	3	5	16900


> New Y[]: 
	
	 0  3  4  1  0  2  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,385

## ITERATION 33 #######################


> Neighbours evaluated; 27
> Selected Move:	1740	4	5	7	15500


> New Y[]: 
	
	 0  3  4  1  0  1  0  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 34 #######################


> Neighbours evaluated; 30
> Selected Move:	1640	3	1	4	17800


> New Y[]: 
	
	 0  0  4  1  3  1  0  2  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,375

## ITERATION 35 #######################


> Neighbours evaluated; 22
> Selected Move:	1690	3	7	0	16300


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 36 #######################


> Neighbours evaluated; 25
> Selected Move:	1690	4	4	3	16500


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 37 #######################


> Neighbours evaluated; 26
> Selected Move:	1690	4	3	8	16200


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 38 #######################


> Neighbours evaluated; 25
> Selected Move:	1680	3	3	7	18700


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 39 #######################


> Neighbours evaluated; 23
> Selected Move:	1680	4	8	4	18800


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,35

## ITERATION 40 #######################


> Neighbours evaluated; 21
> Selected Move:	1680	4	4	5	17200


> New Y[]: 
	
	 2  0  4  0  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 41 #######################


> Neighbours evaluated; 24
> Selected Move:	1680	4	5	7	16800


> New Y[]: 
	
	 2  0  4  0  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 42 #######################


> Neighbours evaluated; 24
> Selected Move:	1640	3	0	3	18600


> New Y[]: 
	
	 0  0  4  2  1  1  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,335

## ITERATION 43 #######################


> Neighbours evaluated; 21
> Selected Move:	1640	4	3	4	18800


> New Y[]: 
	
	 0  0  4  1  2  1  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,33

## ITERATION 44 #######################


> Neighbours evaluated; 16
> Selected Move:	1640	4	4	5	17200


> New Y[]: 
	
	 0  0  4  1  1  2  0  3  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,325

## ITERATION 45 #######################


> Neighbours evaluated; 24
> Selected Move:	1640	4	5	7	16200


> New Y[]: 
	
	 0  0  4  1  1  3  0  2  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,32

## ITERATION 46 #######################


> Neighbours evaluated; 22
> Selected Move:	1640	4	5	3	18000


> New Y[]: 
	
	 0  0  4  3  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,315

## ITERATION 47 #######################


> Neighbours evaluated; 18
> Selected Move:	1640	4	3	8	17700


> New Y[]: 
	
	 0  0  4  1  1  1  0  2  3  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,31

## ITERATION 48 #######################


> Neighbours evaluated; 22
> Selected Move:	1640	4	7	5	19100


> New Y[]: 
	
	 0  0  4  1  1  2  0  1  3  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,305

## ITERATION 49 #######################


> Neighbours evaluated; 18
> Selected Move:	1640	4	5	8	18900


> New Y[]: 
	
	 0  0  4  1  1  3  0  1  2  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,3

## ITERATION 50 #######################


> Neighbours evaluated; 19
> Selected Move:	1640	4	5	7	18500


> New Y[]: 
	
	 0  0  4  1  1  1  0  3  2  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,295

## ITERATION 51 #######################


> Neighbours evaluated; 19
> Selected Move:	1640	3	8	0	16300


> New Y[]: 
	
	 2  0  4  1  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 52 #######################


> Neighbours evaluated; 27
> Selected Move:	1640	4	7	3	18500


> New Y[]: 
	
	 2  0  4  3  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 53 #######################


> Neighbours evaluated; 22
> Selected Move:	1640	4	3	4	18300


> New Y[]: 
	
	 2  0  4  1  3  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 54 #######################


> Neighbours evaluated; 21
> Selected Move:	1640	4	4	5	16700


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  1  0  0  0  0 
 > pw :0,275

## ITERATION 55 #######################


> Neighbours evaluated; 24
> Selected Move:	1640	3	2	8	19000


> New Y[]: 
	
	 2  0  0  1  1  3  0  1  4  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,27

## ITERATION 56 #######################


> Neighbours evaluated; 23
> Selected Move:	1640	4	5	7	18600


> New Y[]: 
	
	 2  0  0  1  1  1  0  3  4  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,265

## ITERATION 57 #######################


> Neighbours evaluated; 22
> Selected Move:	1640	4	7	8	18000


> New Y[]: 
	
	 2  0  0  1  1  1  0  4  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,26

## ITERATION 58 #######################


> Neighbours evaluated; 22
> Selected Move:	1640	4	7	4	20000


> New Y[]: 
	
	 2  0  0  1  4  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,255

## ITERATION 59 #######################


> Neighbours evaluated; 20
> Selected Move:	1640	4	4	5	19700


> New Y[]: 
	
	 2  0  0  1  1  4  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,25

## ITERATION 60 #######################


> Neighbours evaluated; 18
> Selected Move:	1640	4	8	3	20000


> New Y[]: 
	
	 2  0  0  3  1  4  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,245

## ITERATION 61 #######################


> Neighbours evaluated; 21
> Selected Move:	1640	4	3	4	19800


> New Y[]: 
	
	 2  0  0  1  3  4  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,24

## ITERATION 62 #######################


> Neighbours evaluated; 18
> Selected Move:	1740	3	4	1	17500


> New Y[]: 
	
	 2  3  0  1  0  4  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 63 #######################


> Neighbours evaluated; 33
> Selected Move:	1740	4	5	3	18200


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 64 #######################


> Neighbours evaluated; 28
> Selected Move:	1740	4	3	7	15800


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 65 #######################


> Neighbours evaluated; 29
> Selected Move:	2033	1	-1	4	20300


> New Y[]: 
	
	 2  3  0  1  1  1  0  4  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 66 #######################


> Neighbours evaluated; 27
> Selected Move:	1898	3	7	6	20100


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 67 #######################


> Neighbours evaluated; 29
> Selected Move:	1784	3	5	7	21100


> New Y[]: 
	
	 2  3  0  1  1  0  4  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 68 #######################


> Neighbours evaluated; 26
> Selected Move:	1852	4	6	7	20800


> New Y[]: 
	
	 2  3  0  1  1  0  1  4  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,205

## ITERATION 69 #######################


> Neighbours evaluated; 29
> Selected Move:	1906	3	6	9	20800


> New Y[]: 
	
	 2  3  0  1  1  0  0  4  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 70 #######################


> Neighbours evaluated; 27
> Selected Move:	1792	3	4	5	21800


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 71 #######################


> Neighbours evaluated; 25
> Selected Move:	1733	3	9	6	21800


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 72 #######################


> Neighbours evaluated; 22
> Selected Move:	1658	4	7	6	22100


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 73 #######################


> Neighbours evaluated; 24
> Selected Move:	1630	3	7	9	21600


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 74 #######################


> Neighbours evaluated; 26
> Selected Move:	1752	3	5	4	20600


> New Y[]: 
	
	 2  3  0  1  1  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 75 #######################


> Neighbours evaluated; 26
> Selected Move:	1618	3	6	5	21500


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  1  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 76 #######################


> Neighbours evaluated; 23
> Selected Move:	1754	4	5	9	20900


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  4 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 77 #######################


> Neighbours evaluated; 26
> Selected Move:	1610	2	4	-1	16400


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 78 #######################


> Neighbours evaluated; 32
> Selected Move:	1610	4	9	3	17700


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 79 #######################


> Neighbours evaluated; 32
> Selected Move:	1620	3	3	2	16000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 80 #######################


> Neighbours evaluated; 34
> Selected Move:	1840	1	-1	4	20500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,265

## ITERATION 81 #######################


> Neighbours evaluated; 34
> Selected Move:	1835	3	9	7	21000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,27

## ITERATION 82 #######################


> Neighbours evaluated; 24
> Selected Move:	1785	3	5	9	21500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,275

## ITERATION 83 #######################


> Neighbours evaluated; 25
> Selected Move:	1925	3	4	3	21000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 84 #######################


> Neighbours evaluated; 28
> Selected Move:	1880	3	7	6	20500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 85 #######################


> Neighbours evaluated; 33
> Selected Move:	1865	3	9	7	21000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 86 #######################


> Neighbours evaluated; 27
> Selected Move:	1730	3	8	4	21000


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 87 #######################


> Neighbours evaluated; 32
> Selected Move:	1775	3	6	9	21000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 88 #######################


> Neighbours evaluated; 28
> Selected Move:	1740	3	7	6	20500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 89 #######################


> Neighbours evaluated; 31
> Selected Move:	1705	3	3	8	21000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 90 #######################


> Neighbours evaluated; 31
> Selected Move:	1765	3	9	5	20500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 91 #######################


> Neighbours evaluated; 30
> Selected Move:	1668	3	5	7	21500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 92 #######################


> Neighbours evaluated; 22
> Selected Move:	1640	2	4	-1	17000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 93 #######################


> Neighbours evaluated; 35
> Selected Move:	1690	3	6	9	17000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 94 #######################


> Neighbours evaluated; 33
> Selected Move:	1640	3	7	3	14500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 95 #######################


> Neighbours evaluated; 32
> Selected Move:	1630	3	3	4	15000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 96 #######################


> Neighbours evaluated; 32
> Selected Move:	1580	3	9	6	15000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 97 #######################


> Neighbours evaluated; 33
> Selected Move:	1590	3	4	3	14500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 98 #######################


> Neighbours evaluated; 31
> Selected Move:	1570	3	3	5	16000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,335

## ITERATION 99 #######################


> Neighbours evaluated; 33
> Selected Move:	1560	3	0	3	17800


> New Y[]: 
	
	 0  3  4  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 100 #######################


> Neighbours evaluated; 31
> Selected Move:	1610	3	6	9	17800


> New Y[]: 
	
	 0  3  4  2  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 101 #######################


> Neighbours evaluated; 30
> Selected Move:	1610	4	3	5	16400


> New Y[]: 
	
	 0  3  4  1  0  2  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 102 #######################


> Neighbours evaluated; 27
> Selected Move:	1682	1	-1	4	20900


> New Y[]: 
	
	 0  3  4  1  1  2  0  0  1  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 103 #######################


> Neighbours evaluated; 19
> Selected Move:	1718	4	5	9	20800


> New Y[]: 
	
	 0  3  4  1  1  1  0  0  1  2 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 104 #######################


> Neighbours evaluated; 22
> Selected Move:	1734	3	9	6	20600


> New Y[]: 
	
	 0  3  4  1  1  1  2  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 105 #######################


> Neighbours evaluated; 22
> Selected Move:	1646	4	6	5	20900


> New Y[]: 
	
	 0  3  4  1  1  2  1  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 106 #######################


> Neighbours evaluated; 21
> Selected Move:	1680	3	6	7	21400


> New Y[]: 
	
	 0  3  4  1  1  2  0  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 107 #######################


> Neighbours evaluated; 12
> Selected Move:	1640	4	1	3	19400


> New Y[]: 
	
	 0  0  4  3  1  2  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,31

## ITERATION 108 #######################


> Neighbours evaluated; 15
> Selected Move:	1640	4	3	4	19200


> New Y[]: 
	
	 0  0  4  1  3  2  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,315

## ITERATION 109 #######################


> Neighbours evaluated; 13
> Selected Move:	1640	4	4	5	19200


> New Y[]: 
	
	 0  0  4  1  2  3  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,32

## ITERATION 110 #######################


> Neighbours evaluated; 12
> Selected Move:	1640	4	4	3	19000


> New Y[]: 
	
	 0  0  4  2  1  3  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  1  0 
 > pw :0,325

## ITERATION 111 #######################


> Neighbours evaluated; 16
> Selected Move:	1640	3	5	1	17300


> New Y[]: 
	
	 0  3  4  2  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,33

## ITERATION 112 #######################


> Neighbours evaluated; 29
> Selected Move:	1640	4	3	4	17500


> New Y[]: 
	
	 0  3  4  1  2  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 113 #######################


> Neighbours evaluated; 28
> Selected Move:	1640	4	4	7	14500


> New Y[]: 
	
	 0  3  4  1  1  0  0  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 114 #######################


> Neighbours evaluated; 27
> Selected Move:	1640	4	7	8	17200


> New Y[]: 
	
	 0  3  4  1  1  0  0  1  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 115 #######################


> Neighbours evaluated; 27
> Selected Move:	1640	3	8	0	15000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 116 #######################


> Neighbours evaluated; 31
> Selected Move:	1640	3	1	8	17200


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 117 #######################


> Neighbours evaluated; 22
> Selected Move:	1640	4	8	3	17500


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 118 #######################


> Neighbours evaluated; 21
> Selected Move:	1640	4	3	4	17300


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 119 #######################


> Neighbours evaluated; 20
> Selected Move:	1640	4	4	7	15300


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 120 #######################


> Neighbours evaluated; 22
> Selected Move:	1693	1	-1	9	21300


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 121 #######################


> Neighbours evaluated; 21
> Selected Move:	1650	3	9	6	21300


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 122 #######################


> Neighbours evaluated; 24
> Selected Move:	1510	2	4	-1	16800


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,275

## ITERATION 123 #######################


> Neighbours evaluated; 27
> Selected Move:	1560	3	6	9	16800


> New Y[]: 
	
	 2  0  4  1  0  0  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,27

## ITERATION 124 #######################


> Neighbours evaluated; 26
> Selected Move:	1610	3	7	5	16200


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,265

## ITERATION 125 #######################


> Neighbours evaluated; 27
> Selected Move:	1610	4	5	3	18000


> New Y[]: 
	
	 2  0  4  3  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,26

## ITERATION 126 #######################


> Neighbours evaluated; 26
> Selected Move:	1610	4	3	8	17700


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,255

## ITERATION 127 #######################


> Neighbours evaluated; 26
> Selected Move:	1610	4	8	9	16500


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 128 #######################


> Neighbours evaluated; 24
> Selected Move:	1870	1	-1	4	21000


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 129 #######################


> Neighbours evaluated; 27
> Selected Move:	1825	3	9	6	21000


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 130 #######################


> Neighbours evaluated; 27
> Selected Move:	1560	2	4	-1	16500


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 131 #######################


> Neighbours evaluated; 27
> Selected Move:	1560	4	6	3	18000


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 132 #######################


> Neighbours evaluated; 25
> Selected Move:	1560	4	3	5	16200


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 133 #######################


> Neighbours evaluated; 24
> Selected Move:	1560	4	5	8	17700


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 134 #######################


> Neighbours evaluated; 25
> Selected Move:	1586	1	-1	4	22200


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 135 #######################


> Neighbours evaluated; 22
> Selected Move:	1670	3	6	7	22700


> New Y[]: 
	
	 2  0  4  1  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 136 #######################


> Neighbours evaluated; 11
> Selected Move:	1662	4	8	4	22800


> New Y[]: 
	
	 2  0  4  1  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 137 #######################


> Neighbours evaluated; 13
> Selected Move:	1640	4	2	7	18100


> New Y[]: 
	
	 2  0  0  1  3  1  0  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,22

## ITERATION 138 #######################


> Neighbours evaluated; 23
> Selected Move:	1640	4	4	3	18300


> New Y[]: 
	
	 2  0  0  3  1  1  0  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,215

## ITERATION 139 #######################


> Neighbours evaluated; 20
> Selected Move:	1640	4	3	5	16500


> New Y[]: 
	
	 2  0  0  1  1  3  0  4  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,21

## ITERATION 140 #######################


> Neighbours evaluated; 23
> Selected Move:	1640	4	5	7	17800


> New Y[]: 
	
	 2  0  0  1  1  4  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,205

## ITERATION 141 #######################


> Neighbours evaluated; 21
> Selected Move:	1640	4	5	3	18500


> New Y[]: 
	
	 2  0  0  4  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,2

## ITERATION 142 #######################


> Neighbours evaluated; 21
> Selected Move:	1640	4	3	4	18100


> New Y[]: 
	
	 2  0  0  1  4  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,195

## ITERATION 143 #######################


> Neighbours evaluated; 20
> Selected Move:	1640	4	7	5	18500


> New Y[]: 
	
	 2  0  0  1  4  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,19

## ITERATION 144 #######################


> Neighbours evaluated; 19
> Selected Move:	1640	4	4	3	18900


> New Y[]: 
	
	 2  0  0  4  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,185

## ITERATION 145 #######################


> Neighbours evaluated; 19
> Selected Move:	1640	3	5	1	17200


> New Y[]: 
	
	 2  3  0  4  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,18

## ITERATION 146 #######################


> Neighbours evaluated; 32
> Selected Move:	1640	4	3	4	16800


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,175

## ITERATION 147 #######################


> Neighbours evaluated; 31
> Selected Move:	1698	1	-1	5	22300


> New Y[]: 
	
	 2  3  0  1  4  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,17

## ITERATION 148 #######################


> Neighbours evaluated; 19
> Selected Move:	1760	4	4	5	22000


> New Y[]: 
	
	 2  3  0  1  1  4  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,165

## ITERATION 149 #######################


> Neighbours evaluated; 20
> Selected Move:	1757	3	5	9	21900


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,16

## ITERATION 150 #######################


> Neighbours evaluated; 27
> Selected Move:	1706	3	4	5	22900


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,155

## ITERATION 151 #######################


> Neighbours evaluated; 23
> Selected Move:	1628	4	9	5	23500


> New Y[]: 
	
	 2  3  0  1  0  4  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,16

## ITERATION 152 #######################


> Neighbours evaluated; 23
> Selected Move:	1622	3	5	4	22800


> New Y[]: 
	
	 2  3  0  1  4  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,165

## ITERATION 153 #######################


> Neighbours evaluated; 23
> Selected Move:	1673	3	7	5	21800


> New Y[]: 
	
	 2  3  0  1  4  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,17

## ITERATION 154 #######################


> Neighbours evaluated; 24
> Selected Move:	1614	3	9	6	21800


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,175

## ITERATION 155 #######################


> Neighbours evaluated; 24
> Selected Move:	1658	4	4	5	21500


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,18

## ITERATION 156 #######################


> Neighbours evaluated; 25
> Selected Move:	1638	3	5	9	21400


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,185

## ITERATION 157 #######################


> Neighbours evaluated; 28
> Selected Move:	1546	3	4	5	22400


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,19

## ITERATION 158 #######################


> Neighbours evaluated; 23
> Selected Move:	1434	3	8	4	22400


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  4 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 159 #######################


> Neighbours evaluated; 26
> Selected Move:	1578	4	9	6	21600


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 160 #######################


> Neighbours evaluated; 28
> Selected Move:	1610	3	6	7	21800


> New Y[]: 
	
	 2  3  0  1  1  1  0  4  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 161 #######################


> Neighbours evaluated; 26
> Selected Move:	1560	2	4	-1	17300


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 162 #######################


> Neighbours evaluated; 32
> Selected Move:	1610	3	7	2	15500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 163 #######################


> Neighbours evaluated; 33
> Selected Move:	1740	1	-1	7	22000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 164 #######################


> Neighbours evaluated; 24
> Selected Move:	1680	3	9	6	22000


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 165 #######################


> Neighbours evaluated; 25
> Selected Move:	1653	3	7	9	21500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 166 #######################


> Neighbours evaluated; 31
> Selected Move:	1560	2	9	-1	15500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 167 #######################


> Neighbours evaluated; 31
> Selected Move:	1560	3	0	8	17700


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 168 #######################


> Neighbours evaluated; 30
> Selected Move:	1610	3	6	9	17700


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 169 #######################


> Neighbours evaluated; 28
> Selected Move:	1610	4	8	9	16300


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 170 #######################


> Neighbours evaluated; 29
> Selected Move:	1600	3	3	7	18800


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 171 #######################


> Neighbours evaluated; 26
> Selected Move:	1600	4	9	5	18900


> New Y[]: 
	
	 0  3  4  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 172 #######################


> Neighbours evaluated; 24
> Selected Move:	1600	4	5	7	17500


> New Y[]: 
	
	 0  3  4  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 173 #######################


> Neighbours evaluated; 25
> Selected Move:	1833	1	-1	3	21500


> New Y[]: 
	
	 0  3  4  1  0  1  0  2  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 174 #######################


> Neighbours evaluated; 20
> Selected Move:	1790	3	9	6	21500


> New Y[]: 
	
	 0  3  4  1  0  1  1  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 175 #######################


> Neighbours evaluated; 21
> Selected Move:	1598	3	8	4	21500


> New Y[]: 
	
	 0  3  4  1  1  1  1  2  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  1  0  0 
 > pw :0,21

## ITERATION 176 #######################


> Neighbours evaluated; 25
> Selected Move:	1655	3	6	9	21500


> New Y[]: 
	
	 0  3  4  1  1  1  0  2  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 177 #######################


> Neighbours evaluated; 24
> Selected Move:	1560	3	3	8	22000


> New Y[]: 
	
	 0  3  4  0  1  1  0  2  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  1  0 
 > pw :0,21

## ITERATION 178 #######################


> Neighbours evaluated; 20
> Selected Move:	1540	2	9	-1	16000


> New Y[]: 
	
	 0  3  4  0  1  1  0  2  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  1  0 
 > pw :0,215

## ITERATION 179 #######################


> Neighbours evaluated; 27
> Selected Move:	1550	3	4	6	17500


> New Y[]: 
	
	 0  3  4  0  0  1  1  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 180 #######################


> Neighbours evaluated; 28
> Selected Move:	1550	4	7	5	18900


> New Y[]: 
	
	 0  3  4  0  0  2  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 181 #######################


> Neighbours evaluated; 26
> Selected Move:	1560	3	7	3	16400


> New Y[]: 
	
	 0  3  4  1  0  2  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 182 #######################


> Neighbours evaluated; 28
> Selected Move:	1560	4	5	6	16100


> New Y[]: 
	
	 0  3  4  1  0  1  2  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 183 #######################


> Neighbours evaluated; 28
> Selected Move:	1550	3	3	7	18600


> New Y[]: 
	
	 0  3  4  0  0  1  2  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 184 #######################


> Neighbours evaluated; 25
> Selected Move:	1540	3	6	4	19000


> New Y[]: 
	
	 0  3  4  0  2  1  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  1  0 
 > pw :0,225

## ITERATION 185 #######################


> Neighbours evaluated; 22
> Selected Move:	1540	4	4	5	17400


> New Y[]: 
	
	 0  3  4  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  1  0 
 > pw :0,22

## ITERATION 186 #######################


> Neighbours evaluated; 24
> Selected Move:	1540	4	5	8	18700


> New Y[]: 
	
	 0  3  4  0  1  1  0  1  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  1  0 
 > pw :0,215

## ITERATION 187 #######################


> Neighbours evaluated; 26
> Selected Move:	1557	3	4	9	20200


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 188 #######################


> Neighbours evaluated; 25
> Selected Move:	1600	3	8	0	18000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 189 #######################


> Neighbours evaluated; 34
> Selected Move:	1668	1	-1	8	22500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,2

## ITERATION 190 #######################


> Neighbours evaluated; 17
> Selected Move:	1630	3	9	6	22500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,195

## ITERATION 191 #######################


> Neighbours evaluated; 19
> Selected Move:	1610	3	7	9	22000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,19

## ITERATION 192 #######################


> Neighbours evaluated; 29
> Selected Move:	1540	3	8	4	22000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,195

## ITERATION 193 #######################


> Neighbours evaluated; 32
> Selected Move:	1540	2	6	-1	16000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 194 #######################


> Neighbours evaluated; 34
> Selected Move:	1550	3	1	8	18200


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,205

## ITERATION 195 #######################


> Neighbours evaluated; 26
> Selected Move:	1669	1	-1	3	22200


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 196 #######################


> Neighbours evaluated; 18
> Selected Move:	1637	4	8	4	22300


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 197 #######################


> Neighbours evaluated; 21
> Selected Move:	1676	3	4	7	22300


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 198 #######################


> Neighbours evaluated; 19
> Selected Move:	1614	3	9	6	22300


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 199 #######################


> Neighbours evaluated; 20
> Selected Move:	1553	3	7	4	22300


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 200 #######################


> Neighbours evaluated; 19
> Selected Move:	1500	2	3	-1	18300


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 201 #######################


> Neighbours evaluated; 25
> Selected Move:	1550	3	4	7	18300


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,24

## ITERATION 202 #######################


> Neighbours evaluated; 24
> Selected Move:	1600	3	6	9	18300


> New Y[]: 
	
	 2  0  4  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,245

## ITERATION 203 #######################


> Neighbours evaluated; 24
> Selected Move:	1600	4	7	5	18700


> New Y[]: 
	
	 2  0  4  0  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  1  0 
 > pw :0,25
________________________________________________________________

Best solution found: 2280
Run Termination time: 03.02.2010 20:25:38
Run duration: 00:00:37.9531250
________________________________________________________________
